#include<bits/stdc++.h>
using namespace std;
int n,r[100005],ans;
queue<int> q;
int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    cin.tie(0);
    cout.tie(0);
    cin>>n;
    ans=n;
    for(int i=1;i<=n;i++){
        cin>>r[i];
    }
    sort(r+1,r+n+1);
    for(int i=1;i<=n;i++){
        q.push(r[i]);
        if(q.front()<r[i]){
            q.pop();
            ans--;
        }
    }
    cout<<ans;
    return 0;
}
